Formal Modeling of RESTful Systems Using Finite-State Machines
نویسندگان
چکیده
Representational State Transfer (REST), as an architectural style for distributed hypermedia systems, enables scalable operation of the World Wide Web (WWW) and is the foundation for its future evolution. However, although described over 10 years ago, no comprehensive formal model for representing RESTful systems exists. The lack of a formal model has hindered understanding of the REST architectural style and the WWW architecture, consequently limiting Web engineering advancement. In this paper we present a model of RESTful systems based on a finite-state machine formalism. We show that the model enables intuitive formalization of many REST’s constraints, including uniform interface, stateless client-server operation, and code-on-demand execution. We describe the model’s mapping to a system-level view of operation and apply the model to an example Web application. Finally, we outline benefits of the model, ranging from better understanding of REST to designing frameworks for RESTful system development.
منابع مشابه
A Finite-State Machine Approach for Modeling and Analyzing RESTful Systems
Representational State Transfer (REST), as an architectural style for distributed hypermedia systems, enables scalable operation of the World Wide Web and is the foundation for its future evolution. However, although described over 10 years ago, no formal model for representing RESTful systems exists that is comprehensive in following REST principles, intuitive to Web engineers and researchers ...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملUML 2.0 State Machines: Complete Formal Semantics Via core state machine
UML has become the standard modeling language for object-oriented systems. The informal description of UML and its continuous extension cause many ambiguities. Therefore, a formal semantics for UML is necessary, especially for formal reasoning and tool development. We present a formal semantics of UML 2.0 state machines, which are used for modeling the reactive behavior of objects, by (i) deriv...
متن کاملImplementing Finite State Machines Using the CD++ toolkit
DEVS (Discrete EVents systems Specification) is a formal modeling and simulation framework based on generic dynamic systems concepts. DEVS well-defined concepts of coupling of components, hierarchical, modular model construction permitted to provide a common representation for different existing formalisms (including Petri Nets, PDE, and different state machines). Here, we show how to apply the...
متن کاملA Compositional Approach to Bisimulation of Arenas of Finite State Machines
Finite state machines are widely used as a sound mathematical formalism which appropriately describes large scale distributed and complex systems, arising in many technological domains of interest. One of the key issues in the modeling and analysis of such systems is to derive formal methods that cope with their inherent complexity. In this paper we introduce a novel class of non–flat systems t...
متن کامل